Structure Learning of Gaussian Markov Random Fields with False Discovery Rate Control

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Greedy Structure Learning of Markov Random Fields

Acknowledgments I would like to thank my advisor, Pradeep Ravikumar, for inspiration, guidance, and encouragement on this work. In addition, I would like to thank Ali Jalali for his collaboration and work on the proof techniques and theoretical analysis used in this paper. Also, I would also like to thank Inderjit Dhillon and the students of his lab for motivation and many stimulating conversat...

متن کامل

False discovery rate revisited: FDR and topological inference using Gaussian random fields

In this note, we revisit earlier work on false discovery rate (FDR) and evaluate it in relation to topological inference in statistical parametric mapping. We note that controlling the false discovery rate of voxels is not equivalent to controlling the false discovery rate of activations. This is a problem that is unique to inference on images, in which the underlying signal is continuous (i.e....

متن کامل

Learning Gaussian Graphical Models of Gene Networks with False Discovery Rate Control

In many cases what matters is not whether a false discovery is made or not but the expected proportion of false discoveries among all the discoveries made, i.e. the so-called false discovery rate (FDR). We present an algorithm aiming at controlling the FDR of edges when learning Gaussian graphical models (GGMs). The algorithm is particularly suitable when dealing with more nodes than samples, e...

متن کامل

Structure Learning in Markov Random Fields

Scoring structures of undirected graphical models by means of evaluating the marginal likelihood is very hard. The main reason is the presence of the partition function which is intractable to evaluate, let alone integrate over. We propose to approximate the marginal likelihood by employing two levels of approximation: we assume normality of the posterior (the Laplace approximation) and approxi...

متن کامل

False Discovery Rates for Random Fields

This paper extends False Discovery Rates to random fields, where there are uncountably many hypothesis tests. This provides a method for finding local regions in the field where there is a significant signal while controlling either the proportion of area or the number of clusters in which false rejections occur. We develop confidence envelopes for the proportion of false discoveries as a funct...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Symmetry

سال: 2019

ISSN: 2073-8994

DOI: 10.3390/sym11101311